منابع مشابه
∆k-Confluent and Ok-Confluent Graphs
In this paper we extend the concept of ∆-confluence to ∆k-confluence by allowing more generalized junctions, called ∆k-junctions. We present an algorithm for recognizing graphs that are ∆k-confluent. We then generalize ∆k-confluence to Ok-confluence by allowing non-intersecting chords within a junction, resulting in Ok-junctions. We present an algorithm for recognizing graphs that are Ok-conflu...
متن کامل“Disciplines”
American education subscribes wholeheartedly to the idea that only by long, arduous disciplining can real achievement in culture result. The unlucky and unwilling student finds himself faced with the necessity of forcing his emotional and, occasionally, his cortical processes through a rigorous treadmill of tedious facts collected by hordes of the uninspired. The tediousness of the material is,...
متن کاملInce’s limits for confluent and double-confluent Heun equations
We find pairs of solutions to a differential equation which is obtained as a special limit of a generalized spheroidal wave equation (this is also known as confluent Heun equation). One solution in each pair is given by a series of hypergeometric functions and converges for any finite value of the independent variable z, while the other is given by a series of modified Bessel functions and conv...
متن کاملConfluent persistence revisited
It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited space overhead. Updates are performed in O(log n) amortized time, and following a pointer takes O(log c log n) time where c is the in-degree of a node in the data structure. In particular, this proves that confluent persistence can be achieved a...
متن کاملA Confluent Connection Calculusë
This work is concerned with basic issues of the design of calculi and proof procedures for first-order connection methods and tableaux calculi. Proof procedures for these type of calculi developed so far suffer from not exploiting proof confluence, and very often unnecessarily rely on a heavily backtrack oriented control regime. As a new result, we present a variant of a connection calculus and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1999
ISSN: 0028-0836,1476-4687
DOI: 10.1038/45679